The continually optimized connecting relation is gained via perceptron and xor function , then the optimal path graph is found 利用感知器异或函数获得了节点之间不断优化的连接关系,然后得到最优路径图。
In the mathematical field of graph theory, a path graph or linear graph is a particularly simple example of a tree, namely a tree with two or more vertices that is not branched at all, that is, contains only vertices of degree 2 and 1. In particular, it has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2.